Rate Analysis and Deadlock Detection for HUME

نویسنده

  • Robert Pointon
چکیده

HUME is a domain-specific programming language targeting resourcebounded computations, such as real-time embedded systems. Rate analysis is a novel algorithm for HUME that determines the relative rates (i.e. how often events occur, or components need to run) within the whole system, and as such the algorithm possess the following useful properties: • Deadlock Detection – of some cases. • Scheduling – suggesting priority of components and possible parallelism. • Static – can be performed before running the program. • Cheap – polynomial algorithm. Finally for completeness, runtime deadlock detection within HUME also turns out to be very cheap and the algorithm is given is well.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combining Static Analysis and Testing for Deadlock Detection

Static deadlock analyzers might be able to verify the absence of deadlock, but when they detect a potential deadlock cycle, they provide little (or even none) information on their output. Due to the complex flow of concurrent programs, the user might not be able to find the source of the anomalous behaviour from the abstract information computed by static analysis. This paper proposes the combi...

متن کامل

Deadlock Detection and Recovery for True Fully Adaptive Routing in Regular Wormhole Networks

Deadlock detection and recovery-based routing schemes for wormhole networks have gained attraction because unlike deadlock avoidance-based schemes, they do not restrict routing adaptability. In order to alleviate the overhead of running a recovery procedure, the studies on deadlock detection have focused on the accuracy of deadlock detection, trying to reduce the number of false detections. Thi...

متن کامل

Deadlock Guided Testing in CLP

Static deadlock analyzers might be able to verify the absence of deadlock. However, they are usually not able to detect its presence. Also, when they detect a potential deadlock cycle, they provide little (or even no) information on their output. Due to the complex flow of concurrent programs, the user might not be able to find the source of the anomalous behaviour from the abstract information...

متن کامل

Eecient Deadlock Detection in Distributed Systems

The performance of a deadlock detection scheme, in terms of number of message transmission and the size of the messages, is an important concern in distributed systems. In this paper, we propose an in-cremental approach for deadlock detection, which can dramatically improve the performance of previously published centralized and hierarchical deadlock detection schemes. Two deadlock detection al...

متن کامل

Deadlock Detection in Basic Models of MPI Synchronization Communication Programs

Deadlock Detection in Basic Models of MPI Synchronization Communication Programs LIAO Ming-xue, FAN Zhi-hua (Institute of Software, the Chinese Academy of Sciences, Beijing 100080, China) Abstract: A model of MPI synchronization communication programs is presented and its three basic simplified models are also defined. A series of theorems and methods for deciding whether deadlocks will occur a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003